1

The greedy coloring is a bad probabilistic algorithm

Year:
1991
Language:
english
File:
PDF, 505 KB
english, 1991
3

Non-algebraic concrete categories

Year:
1973
Language:
english
File:
PDF, 550 KB
english, 1973
4

Expected complexity of graph partitioning problems

Year:
1995
Language:
english
File:
PDF, 927 KB
english, 1995
6

Computing OR on a randomized fixed adversary CRCW PRAM

Year:
1997
Language:
english
File:
PDF, 137 KB
english, 1997
7

Every category is a factorization of a concrete one

Year:
1971
Language:
english
File:
PDF, 146 KB
english, 1971
8

Foreword

Year:
2009
Language:
english
File:
PDF, 131 KB
english, 2009
9

On universal concrete categories

Year:
1975
Language:
english
File:
PDF, 137 KB
english, 1975
10

Parallel computation and conflicts in memory access

Year:
1982
Language:
english
File:
PDF, 537 KB
english, 1982
12

Graphs with small chromatic numbers are easy to color

Year:
1989
Language:
english
File:
PDF, 447 KB
english, 1989
16

Isomorphism Testing of Unary Algebras

Year:
1988
Language:
english
File:
PDF, 1.52 MB
english, 1988
27

Visualisation of algorithms

Year:
2005
Language:
english
File:
PDF, 330 KB
english, 2005